Non-Determinism and Nash Equilibria for Sequential Game over Partial Order

نویسنده

  • Stéphane Le Roux
چکیده

In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium. But if payoffs range over a partially ordered set instead of the reals, then the backward induction predicate does no longer imply the Nash equilibrium predicate. Non-determinism is a solution: a suitable non-deterministic backward induction function returns a non-deterministic strategy profile which is a nondeterministic Nash equilibrium. The main notions and results in this article are constructive, conceptually simple and formalised in the proof assistant Coq.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence

Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of the proof are as follows: First, a procedure expecting a sequential game as an input is defined as “backward induction” in game theory. Second, it is proved that the procedure yields a Nash equilibrium. “Backward induction” act...

متن کامل

Bayes correlated equilibrium and the comparison of information structures in games

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states, the payoff functions, and the common prior over the payoff states. The information structure refers to the signals that the players receive in the game. We characterize the set of outcomes that can arise in Bayes Nash equilibrium...

متن کامل

A simple and numerically stable primal-dual algorithm for computing Nash-equilibria in sequential games with incomplete information

We present a simple primal-dual algorithm for computing approximate Nash equilibria in two-person zero-sum sequential games with incomplete information and perfect recall (like Texas Hold’em poker). Our algorithm only performs basic iterations (i.e matvec multiplications, clipping, etc., and no calls to external first-order oracles, no matrix inversions, etc.) and is applicable to a broad class...

متن کامل

Game version of the Bruss’ problem

In the sequential decision making task known as the best choice problem, n items are presented in a random order one at a time. After each item, the decision maker can determine only their relative ranks. The goal of decision maker is to select the best of all n items without the possibility of recalling previously observed items. Many important business decisions such as choosing a venture par...

متن کامل

Nash Equilibria in Partial-Information Games on Markov Chains∗

We consider a two-player partial-information game on a Markov chain, where each player attempts to minimize its own cost over a finite time horizon. We show that this game has always a Nash equilibrium in stochastic behavioral policies. The technique used to prove this result is constructive but has severe limitations because it involves solving an extremely large bi-matrix game. To alleviate t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006